IEEE International Conference On Communications Research Articles

(Digital Presentation) Soft Robot for Heat Source Detection Using Shape Memory Gel

Currently, there are Collaborative robots (cobots) that use multiple robots to solve a single, simple task, such as finding survivors in rubble or monitoring the environment during a disaster. [1] Such robots are moved by vibration motors and communicate with nearby robots via infrared communication for control.In this study, we develop a soft robot that can search for heat sources and solve simple tasks using only a simple structure without any sensors. This soft robot can move by simply vibrating and has a mechanism to switch its motion mode when the temperature of the ground surface or the air changes. The robot is equipped with shape-memory gel [1], which softens and increases the friction rate as the temperature rises, and hardens and decreases the friction rate as the temperature decreases. The shape-memory gel has the property of remaining stationary when the temperature on the ground or in the air rises, and operating when it falls. In our experiments, we measured the absorption of vibration, friction rate, and tackiness in order to verify the effectiveness of controlling the motion of the shape memory gel by temperature. It was confirmed that the vibration was absorbed when the shape memory gel became warm and soft. In the measurement of friction rate and tackiness by temperature, it was confirmed that both friction rate and tackiness increased by increasing the temperature. As a result, the effectiveness of the shape-memory gel was confirmed by temperature. Next, we fabricated a soft robot as shown in Fig. 1 and conducted experiments to see if its motion changed depending on temperature. In the future, we will conduct experiments to see if the soft robot can be used to solve simple tasks such as transporting plants to sunlight.Reference:[1] Michael Rubenstein, Christian Ahler, Radhika Nagpal Kilobot, “A low cost scalable robot system for collective behaviors” 2012 IEEE International Conference on Communications (ICC)https://ieeexplore.ieee.org/document/6224638[2] Ahmed, Aamir, Sandeep Arya, Vinay Gupta, Hidemitsu Furukawa, and Ajit Khosla. "4D printing: Fundamentals, materials, applications and challenges." Polymer (2021): 123926. https://doi.org/10.1016/j.polymer.2021.123926 Figure 1

Steganography in Color Animated Image Sequence for Secret Data Sharing Using Secure Hash Algorithm

Steganography is one of the leading strategy that is employed to hide restricted content into a cover media so that the person unaware of the fact can’t predict that the cover media can acquire some secret information. The effectiveness of any steganographic approach is appraised on imperceptibility of the stego-media, payload of the cover media, integrity of the secret information, security, and computational complexity. The work presented in this paper focuses on these important concerns of secured data transmission. The proposed steganographic approach uses multimedia files including animated image sequences as cover media for concealing secret messages. The entire secret information to be embedded is converted to a code using Secure Hash Algorithm-1 (SHA-1) (National Institute of Standards, and Technology (US). Technology Administration. Secure hash standard, 1993) and shared with the secret message to validate the authenticity of the transmitted secret information. The whole secret message is converted to its ASCII to embed them by replacing the least significant digit (LSD) (Liu et al. In Proceedings of the 2012 IEEE International Conference on Communications (ICC), IEEE, 2012). The receiver validates the transmitted information with SHA-1 again generating a code, which validates with the existing code sent over from the transmitting end. The proposed algorithm is worked upon a variety of text messages with a large set of color animated image sequences as cover media and also has been tested carefully by different parametric measures. This algorithm gives robust outputs in terms of visual imperceptibility, safety, and embedding capability.

Combining Power Allocation and Superposition Coding for an Underlay Two-way Decode-and-forward Scheme

Combining Power Allocation and Superposition Coding for an Underlay Two-way Decode-and-forward Scheme

Guest Editorial

Guest Editorial

Price-based resource allocation for revenue maximization with cooperative communication

In recent years, cooperative communication becomes a promising technology to improve the spatial diversity for the future mobile network. Under this communication paradigm, both relay assignment and power allocation will greatly impact the network performance. However, since each device may be selfish, a significant challenge is to make the joint resource allocation robust to node selfishness while pursuing the maximum system revenue in the commercial network. This paper mainly studies the price-based joint relay-power allocation problem which aims to maximize the revenue (JRP-RM) while satisfying the bandwidth requirement with cooperative communication. We first analyze the power allocation under the bandwidth and selfishness constraints for different communication modes. According to the analytical results, this paper presents a polynomial-time algorithm, namely MRPA, to solve the JRP-RM problem. We prove its correctness and show that it can achieve an approximation ratio of $$1 - \varepsilon$$ , where $$\varepsilon$$ is an arbitrarily positive constant. Moreover, we study the JRP-RM problem under a special case where the cost and payment are both linear functions of the transmission power. The simulation results show that MRPA can increase the system revenue about 34.2 and 18.9 % compared with the OPRA Yang et al. (2011 IEEE International Conference on Communications (ICC). IEEE, pp 1–6, 2011) and JRPA Xu et al. (Wirel Netw pp 2209–2219, 2010) algorithms while satisfying the selfishness constraint in most situations.

Guest editorial: Selected papers from IEEE/CIC ICCC2014

Since its successful inauguration in Beijing, August, 2012, the IEEE international Conference on Communications (ICCC) has been globally recognized as one of the important annual international conferences held by the IEEE Communication Society (ComSoc) and China Institute of Communications (CIC). IEEE/CIC ICCC'14, the third ICCC held in Shanghai, China, 13–15 October, 2014, continued to expand its influence and had attracted distinguished scholars, key researchers, young investigators and ambitious students from dozens of countries and regions. The technical program of ICCC 2014 features 4 world-class plenary keynote speeches, 8 technical symposia, 5 tutorials, 4 industrial and academic panels and 1 workshop, covering from decades-long hot topics such as MIMO, interference coordination, heterogeneous networks and etc., to recent eye-catchers such as big data and social networks. The conference not only provided a forum and seminar for active researchers from every directions of this academia, but also attracted delegates from the main players in the industry.

Editoral: Special Issue on Photonic and RF Communications Systems

Editoral: Special Issue on Photonic and RF Communications Systems

IEEE ICC 2013 concludes with thousands of international communications experts attending hundreds of presentations in Budapest, Hungary [Conference Review

The IEEE International Conference on Communications (ICC) recently concluded its latest high-profile event with nearly 2,000 scientists, academics and international communications experts attending more than 1,500 presentations dedicated to the next wave of global voice, data, image and tele-presence multimedia technologies.

Comsoc's flagship conferences: GLOBECOM and ICC [The President's Message

Twice a year they assemble, regular as clockwork. They come from every continent, and they have met on every continent, save one (Antarctica). Their gatherings are thousands strong. They come to talk and listen, to argue and debate, to teach and learn. They represent every discipline and sub-discipline of their profession, and the excellence of their meetings is beyond dispute. No disaster, man-made or natural, has ever kept these meetings from happening (and we hope none ever will). Of whom do we speak? Of course, we speak of the members of the IEEE Communications Society (ComSoc) and others in our profession who attend the two flagship conferences of Com- Soc, the IEEE Global Communications Conference (GLOBECOM) and the IEEE International Conference on Communications (ICC).

Coherence time-based cooperative MAC protocol 1 for wireless ad hoc networks

In this article, we address the goal of achieving performance gains under heavy-load and fast fading conditions. CoopMACI protocol proposed in Proceedings of the IEEE International Conference on Communications (ICC), Seoul, Korea, picks either direct path or relay path based on rate comparison to enhance average throughput and delay performances. However, CoopMACI performance deteriorates under fading conditions because of lower direct path or relay path reliability compared to UtdMAC (Agarwal et al. LNCS, 4479, 415-426, 2007). UtdMAC was shown to perform better than CoopMACI in terms of average throughput and delay performances because of improved transmission reliability provided by the backup relay path. Although better than CoopMACI, UtdMAC does not fully benefit from higher throughput relay path (compared to the direct path), since it uses relay path only as a secondary backup path. In this article, we develop a cooperative MAC protocol (termed as instantaneous relay-based cooperative MAC--IrcMAC) that uses channel coherence time and estimates signal-to-noise ratio (SNR) of source-to-relay, relay-to-destination, and source-to-destination links, to reliably choose between relay path or direct path for enhanced throughput and delay performances. Unique handshaking is used to estimate SNR and single bit feedbacks resolve contentions among relay nodes, which further provides source node with rate (based on SNR) information on source-to-destination, source-to-relay, and relay-to-destination links. Simulation results clearly show that IrcMAC significantly outperforms the existing CoopMACI and the UtdMAC protocols in wireless ad hoc network. Results show average throughput improvements of 41% and 64% and average delay improvementd of 98.5% and 99.7% compared with UtdMAC and CoopMACI, respectively.

Efficient automatic gain control algorithm and architecture for wireless LAN receivers

The performance of a receiver front-end limits the quality and range of the given communication link. An appropriate design based on well-defined system parameters and architecture can make a huge difference in the performance, cost and marketability of the entire system. In particular, there is a need for improved digital automatic gain control (AGC) for use in multi-input multi-output orthogonal frequency division multiplexing (MIMO-OFDM) systems with application to wireless local area networks (WLANs), targeted for the upcoming 802.11n standard [Heejung Yu et al., IEEE 802.11 wireless LANs ETRI proposal specification for IEEE 802.11 TGn, IEEE 802.11 document, doc. No. 11-04-0923-00-000n, August, 2004; H. Yu, T. Jeon, S. Lee, Design of dual-band MIMO-OFDM system for next generation wireless LAN, in: IEEE International Conference on Communications (ICC), May, 2005]. In this paper, we propose an efficient algorithm and implementation of the digital AGC for next generation WLANs. The proposed AGC algorithm has two feedback loops for gain control to improve convergence speed, and at the same time maintains the stability of the AGC circuit. Also, a complete set of parameters for practical implementation is obtained by various experiments with fixed point constraints and accuracy requirements.

Energy efficient organization of mobile sensor networks

One of the main design issues for a sensor network is conservation of energy available at each sensor node. To increase lifetime of a sensor network, we can organize the sensors into disjoint sets so that only one set is active at a time. The lifetime of the network increases proportionally to the number of disjoint sets. In general, sensors are randomly scattered in the monitored area, thus the number of disjoint sets is significantly smaller than in the ideal case. In this paper, we propose a way to increase the number of disjoint sets using mobile sensors. We organize sensors into disjoint sets using the heuristic proposed by Sljepcevic and Potkonjak, Power efficient organization of wireless sensor networks IEEE International Conference on Communications (ICC) 2001. Then, we rearrange mobile sensors that are not included in any set. The rearrangement process consists of two phases. In the first phase, we identify the fields that are not covered by any of the remaining sensors. Then we identify the locations from which mobile sensors could cover the fields. In the second phase, our proposed heuristic selects sensors to be rearranged and locations where they will move to. This selection is made by considering the coverage before and after a mobile sensor is moved. Our experiments show that we can effectively increase the number of disjoint set with a small number of mobile sensors rearranged.

On Stopping Times for a Wiener Process

Previous article Next article On Stopping Times for a Wiener ProcessA. A. NovikovA. A. Novikovhttps://doi.org/10.1137/1116049PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] H. Bateman and , A. Erdélyi, Higher transcendental functions. Vol. II, McGraw-Hill Book Company, Inc., New York-Toronto-London, 1953xvii+396 MR0058756 0052.29502 Google Scholar[2] I. I. Gikhman and , A. V. Skorokhod, Stochastic Differential Equations, Izd-vo “Naukova dumka”, Kiev, 1968, (In Russian.) Google Scholar[3] J. L. Doob, Stochastic processes, John Wiley & Sons Inc., New York, 1953viii+654 MR0058896 0053.26802 Google Scholar[4] Kiyoshi Itô and , Henry P. McKean, Jr., Diffusion processes and their sample paths, Die Grundlehren der Mathematischen Wissenschaften, Band 125, Academic Press Inc., Publishers, New York, 1965xvii+321 MR0199891 0127.09503 CrossrefGoogle Scholar[5] P. Warwick Millar, Martingale integrals, Trans. Amer. Math. Soc., 133 (1968), 145–166 MR0226721 0164.46603 CrossrefGoogle Scholar[6] L. A. Shepp, A first passage problem for the Wiener process, Ann. Math. Statist., 38 (1967), 1912–1914 MR0217879 0178.19402 CrossrefGoogle Scholar[7] A. A. Novikov, On moment inequalities for stochastic integrals, Theory Prob. Applications, 16 (1971), 538–541 10.1137/1116058 0246.60047 LinkGoogle Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails Пересечение броуновским движением границы порядка квадратного корняТруды Математического института имени В. А. Стеклова, Vol. 316 | 19 April 2022 Cross Ref Crossing an Asymptotically Square-Root Boundary by the Brownian MotionProceedings of the Steklov Institute of Mathematics, Vol. 316, No. 1 | 27 April 2022 Cross Ref Obstacle Problems Generated by the Estimates of Square FunctionGeometric Aspects of Harmonic Analysis | 24 February 2021 Cross Ref The Bellman Function Technique in Harmonic Analysis16 July 2020 Cross Ref On the first hitting time density for a reducible diffusion processQuantitative Finance, Vol. 20, No. 5 | 19 February 2020 Cross Ref First exit times of harmonically trapped particles: a didactic reviewJournal of Physics A: Mathematical and Theoretical, Vol. 48, No. 1 | 9 December 2014 Cross Ref Remarks on moment inequalities and identities for martingalesStatistics & Probability Letters, Vol. 83, No. 4 | 1 Apr 2013 Cross Ref First passage time problems with applications to synchronization2012 IEEE International Conference on Communications (ICC) | 1 Jun 2012 Cross Ref The Skorokhod embedding problem and its offspringProbability Surveys, Vol. 1, No. none | 1 Jan 2004 Cross Ref PASSPORT OPTIONSMathematical Finance, Vol. 12, No. 4 | 1 Oct 2002 Cross Ref Solving non–linear optimal stopping problems by the method of time–changeStochastic Analysis and Applications, Vol. 18, No. 5 | 1 Jan 2000 Cross Ref Approximations of boundary crossing probabilities for a Brownian motionJournal of Applied Probability, Vol. 36, No. 4 | 14 July 2016 Cross Ref Sequential Testing for Several Signals in Gaussian White NoiseTheory of Probability & Its Applications, Vol. 28, No. 3 | 17 July 2006AbstractPDF (814 KB)On Brownian slow pointsZeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete, Vol. 64, No. 3 | 1 Sep 1983 Cross Ref Semi-martingale inequalities via the Garsia-Rodemich-Rumsey lemma, and applications to local timesJournal of Functional Analysis, Vol. 49, No. 2 | 1 Nov 1982 Cross Ref On Discontinuous MartingalesTheory of Probability & Its Applications, Vol. 20, No. 1 | 17 July 2006AbstractPDF (1276 KB)On an Identity for Stochastic IntegralsTheory of Probability & Its Applications, Vol. 17, No. 4 | 28 July 2006AbstractPDF (413 KB)On Moment Inequalities for Stochastic IntegralsTheory of Probability & Its Applications, Vol. 16, No. 3 | 17 July 2006AbstractPDF (379 KB)A martingale approach to first passage problems and a new condition for Wald's identityStochastic Differential Systems Cross Ref Volume 16, Issue 3| 1971Theory of Probability & Its Applications401-574 History Submitted:13 June 1969Published online:17 July 2006 InformationCopyright © Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1116049Article page range:pp. 449-456ISSN (print):0040-585XISSN (online):1095-7219Publisher:Society for Industrial and Applied Mathematics

On the Continuity of the Generalized Inverse

On the Continuity of the Generalized Inverse