Log in

Relevant bibliographies by topics / Node to Node Communication

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Node to Node Communication'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Node to Node Communication.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Node to Node Communication"

1

Cheng, Wei, and Zhen Hua Tan. "Correlation Trust Authentication Model for Peer-to-Peer Networks." Advanced Materials Research 756-759 (September 2013): 2237–42. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.2237.

Full text

Abstract:

A requester node requesting a service in a peer to peer network transmits a request to a service provider node. The request may include a communication history of the requester node identifying other nodes with which the requester node has previously communicated. The service provider node authenticates the requester node based on the communication history. The service provider node may ask other nodes with which the requester node has communicated for evaluation of the requester node. The other nodes may calculate a trust metric of the requester node and provide this metric to the service provider node. The service provider node may use this trust metric in combination with a similarity calculation of the requester node and the service provider node to make a determination whether the requester node is to be authenticated. The service provider node may evaluate the requester node and store the evaluation in its communication history.

APA, Harvard, Vancouver, ISO, and other styles

2

Zhang, Xiao Juan, Zu Lin Wang, and Zhi Xia Zhang. "Finding Most Vital Node in Satellite Communication Network." Applied Mechanics and Materials 635-637 (September 2014): 1136–39. http://dx.doi.org/10.4028/www.scientific.net/amm.635-637.1136.

Full text

Abstract:

An improved node importance evaluation method is proposed. The importance of nodes are not only determined by its location in the network, but also limited by the contribution of its neighboring nodes. The location of the node is determined by its betweenness. The contribution of the node is impacted by the betweenness and closeness centrality of its neighboring nodes. Experiments show that this proposed method is suitable for satellite communication network applications, and obtains accurate evaluation results.

APA, Harvard, Vancouver, ISO, and other styles

3

Kim, Kihyun, and Sunmyeng Kim. "Cross Layer Based Cooperative Communication Protocol for Improving Network Performance in Underwater Sensor Networks." International Journal of Engineering and Technology Innovation 10, no. 3 (July 1, 2020): 200–210. http://dx.doi.org/10.46604/ijeti.2020.5327.

Full text

Abstract:

For underwater sensor networks (USNs), cooperative communications have been introduced to improve network performance with the help of relay nodes. The previous cooperative communications select the best relay node on a hop-by-hop basis. Therefore, they have limitations in improving performance. In order to get better performance, a cooperative communication protocol based on the cross layer is proposed in this paper. The proposed protocol uses the information provided by a routing protocol at the network layer for the erroneous data packet delivery. It selects one with the minimum routing cost among relay candidate nodes. The routing protocol in the selected relay node provides the MAC layer with the address of the next hop node on the path to the sink node. Then, the MAC layer in the selected relay node forwards the erroneous data packet to the next hop node rather than a receiver node. Performance studies are carried out through simulation. Simulation results show that the proposed protocol has about 21.8% lower average delay and about 14.4% lower average number of nodes passed than the previous protocol, regardless of the maximum transmission range.

APA, Harvard, Vancouver, ISO, and other styles

4

Cynthia, Antony, and V. Saravanan. "Tango Binary Search Tree Based Asymmetric Cryptographic Sensor Node Authentication for Secured Communication in Wireless Sensor Networks." Sensor Letters 18, no. 1 (January 1, 2020): 55–63. http://dx.doi.org/10.1166/sl.2020.4189.

Full text

Abstract:

Wireless sensor network (WSN) comprises the group of sensor nodes distributed to sense and monitor the environments and collects the data. Due to the distributed nature of the sensor nodes, security is a major role to access the confidential data and protect the unauthorized access. In order to improve the secure communication, authentication is essential process in WSN. A Tango Binary Search Tree based Schmidt Cryptographic Sensor Node Authentication (TBST-SCSNA) technique is introduced for secured data communication in WSN with higher authentication accuracy. Initially, the trust values for each sensor nodes are calculated for increasing the security in data communication. The sensor nodes in WSN are arranged in tango binary search tree based on the trust value. The nodes in tree are inserted or removed based on their deployment. After that, the Schmidt-Samoa cryptographic technique is applied for node authentication and secure data communication. The cryptographic technique comprises three processes key generation, encryption and decryption. In key generation phase, the public key (i. e., node_ID) are generated and distributed for the sensor nodes and private key is kept secret using Schmidt-Samoa algorithm. The root node is embedded with a key during the deployment and it is controlled the entire the sensor nodes in the path. A Parent node generates the keys for child node based on the ID of parent node. After the key generation, the sender node encrypts the data packet and transmits to receiver node in the tree with the receiver node ID. After that, the receiver node enters their private key and verifies it with already stored key at the time of key generation. If both keys are same, then the node is said to be authentic node. Otherwise, the sensor node is said to be a malicious node. The authentic node only receives the original data packets. This process gets repeated till all the nodes in the path verify their identities and performs the secure communication. Simulation is carried out with different parameters such as authentication accuracy, authentication time and security level with respect to a number of sensor nodes and a number of data packets. The results observed that the TBST-SCSNA technique efficiently improves the node authentication accuracy, security level with minimum time than the state-of-the-art-methods.

APA, Harvard, Vancouver, ISO, and other styles

5

Shan, Axida, Xiumei Fan, Celimuge Wu, Xinghui Zhang, and Shujia Fan. "Quantitative Study on the Impact of Energy Consumption Based Dynamic Selfishness in MANETs." Sensors 21, no. 3 (January 21, 2021): 716. http://dx.doi.org/10.3390/s21030716.

Full text

Abstract:

Cooperative communication and resource limitation are two main characteristics of mobile ad hoc networks (MANETs). On one hand, communication among the nodes in MANETs highly depends on the cooperation among nodes because of the limited transmission range of the nodes, and multi-hop communications are needed in most cases. On the other hand, every node in MANETs has stringent resource constraints on computations, communications, memory, and energy. These two characteristics lead to the existence of selfish nodes in MANETs, which affects the network performance in various aspects. In this paper, we quantitatively investigate the impacts of node selfishness caused by energy depletion in MANETs in terms of packet loss rate, round-trip delay, and throughput. We conducted extensive measurements on a proper simulation platform incorporating an OMNeT++ and INET Framework. Our experimental results quantitatively indicate the impact of node selfishness on the network performance in MANETs. The results also imply that it is important to evaluate the impact of node selfishness by jointly considering selfish nodes’ mobility models, densities, proportions, and combinations.

APA, Harvard, Vancouver, ISO, and other styles

6

Zhao, Bo Wen. "Monitoring Technological Analysis of Communication Network Platform." Applied Mechanics and Materials 687-691 (November 2014): 2630–34. http://dx.doi.org/10.4028/www.scientific.net/amm.687-691.2630.

Full text

Abstract:

Node virtual network platform is designed and realized in allusion to node administration application scenarios in cloud computing, and distributed database and virtual network model with dynamic network features are put forward; nodes build node network through self-discovery packet and provide ability of addressing capability through built-in database engine. In the environment of super-large scale, node degree influences the whole virtual network platform. Through test, this platform can meet the needs of dynamic condition of application node brought by the explosive application request.

APA, Harvard, Vancouver, ISO, and other styles

7

Lu, Peng, Guang Wei Zhang, and Fang Chun Yang. "Node Capture Attack Detection in Dynamic WSNs Based on New Node Tracking." Advanced Materials Research 945-949 (June 2014): 2372–79. http://dx.doi.org/10.4028/www.scientific.net/amr.945-949.2372.

Full text

Abstract:

Since the nodes of WSNs are always deployed on the outside, nodes are easy to be captured. The traditional detection approaches of capture attack can be categorized as approaches based on time of absence and approaches based on target tracking. The former only suitable in static WSNs and the latter usually requires a large communication cost. In this paper, a novel node capture attack detection approach is proposed in dynamic WSNs. Through this approach, every node record its neighbors and detect new nodes in real-time, if new nodes join in the network, a new node tracking algorithm is performed in WSNs and find out which of them are captured by adversaries. Simulation results show that, this method can greatly improve the detection accuracy in dynamic WSNs, and the communication cost is low.

APA, Harvard, Vancouver, ISO, and other styles

8

Nugroho, Rino, Mahar Faiqurahman, and Zamah Sari. "Implementasi Push Message Dengan Menggunakan Restful Web Service Pada Komunikasi Wireless Sensor." Jurnal Repositor 2, no. 1 (January 4, 2020): 79. http://dx.doi.org/10.22219/repositor.v2i1.207.

Full text

Abstract:

Wireless Sensor Network (WSN) is a wireless network consisting of one or more nodes even numbering thousands. The nodes in the wireless sensor network (WSN) consist of sensor nodes and sink nodes. The use of wireless sensors on the network can form a node that can communicate with each other. The communication process generally uses a pull mechanism that precedes the data query process from the node to node sensor that provides sensing data. In some wireless sensor node architecture, this pull mechanism is considered less effective because the node sink must first request data to the sensor node. Alternative, a push message mechanism can be used to transmit sensed data within specified or determined time intervals.In this research is implemented push message mechanism by using restful web service in wireless sensor communications. Test results on the delivery of data by push data transmission obtained to sink nodes alternately in accordance with the order of destination address listed or stored in memory sensor node. And in doing data delivery to be efficient in the absence of data requests at any time.

APA, Harvard, Vancouver, ISO, and other styles

9

Wang, Zhi Gang. "A Wireless Mesh Network Node Query Method Research." Applied Mechanics and Materials 416-417 (September 2013): 1570–73. http://dx.doi.org/10.4028/www.scientific.net/amm.416-417.1570.

Full text

Abstract:

In the wireless mesh networks, identification of nodes does not need to set the address, only take the manufacturing time of the node as the sequence to identify. Nodes in the query and data transmission adopt a master - slave mode. The center node initializes slave-node according to the node of the manufacturing time sequence, through the search command, search to find the slave-node. The newly found node recursive search is for the next batch of nodes. Eventually form a wireless mesh network. Center nodes and the nodes of data communication are made by mesh network.

APA, Harvard, Vancouver, ISO, and other styles

10

Fanti, Giulia, Nina Holden, Yuval Peres, and Gireeja Ranade. "Communication cost of consensus for nodes with limited memory." Proceedings of the National Academy of Sciences 117, no. 11 (March 4, 2020): 5624–30. http://dx.doi.org/10.1073/pnas.1912980117.

Full text

Abstract:

Motivated by applications in wireless networks and the Internet of Things, we consider a model of n nodes trying to reach consensus with high probability on their majority bit. Each node i is assigned a bit at time 0 and is a finite automaton with m bits of memory (i.e.,2mstates) and a Poisson clock. When the clock of i rings, i can choose to communicate and is then matched to a uniformly chosen node j. The nodes j and i may update their states based on the state of the other node. Previous work has focused on minimizing the time to consensus and the probability of error, while our goal is minimizing the number of communications. We show that, whenm>3⁡log⁡log⁡log(n), consensus can be reached with linear communication cost, but this is impossible ifm<log⁡log⁡log(n). A key step is to distinguish when nodes can become aware of knowing the majority bit and stop communicating. We show that this is impossible if their memory is too low.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Node to Node Communication"

1

Kennedy, B. Scott. "Reconfigurable multi-node wireless communication testbed." [Gainesville, Fla.] : University of Florida, 2004. http://purl.fcla.edu/fcla/etd/UFE0004832.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Rosén, Anders. "Embedded Communication Channel for Node Communication in WDM Networks." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-209167.

Full text

Abstract:

Optical Transport Network is a set of Optical Network Elements (NE) connected by optical fiber links able to provide support for optical networking using Wavelength-Division Multiplexing (WDM). In order to be able to introduce link-level applications that require NE-to-NE communication in a packet-optical network, an embedded communication channel is needed. Examples of such applications are dual-ended protection, remote configurationand path trace. By implementing a NE-to-NE communication channel, the exchange of commands and information will allow for implementation of applications that will increase the data link stability in the network. The purpose of this work has been to prove the feasibility of such a channel. This thesis discusses the possibilities of implementing such a channel adjusted to Transmode's layer 1 products without causing disturbance inthe regular traffic or affecting any existing embedded communication. It also proves the channels function in a proof-of-concept manner by demonstrating a simple Path trace application run upon an implementation of the channel on hardware. The chosen solution is an Embedded Communication Channel driver intended to provide termination points for an Embedded Communication Channel (ECC), supervising the connectivity of the channel and relay messages to applications. This thesis project has been carried out at Infinera Corporation (earlier Transmode Systems AB) during summer/autumn 2015.

APA, Harvard, Vancouver, ISO, and other styles

3

Nazrul, Shahbaz. "Survivability Analysis of Two Specific 16-Node, 24-Link Communication Networks." Thesis, Virginia Tech, 1998. http://hdl.handle.net/10919/36858.

Full text

Abstract:

A highly survivable communication network is desirable, as service disruption is usually not tolerated. In this thesis we mainly investigate and discuss the survivability of two specific communication networks, termed topology 1 and 2, under usual network failures. The survivability of the networks mainly comes from their structure. Both topologies have different routes between all source-destination pairs, which gives the networks high route diversity. In fact, both topologies considered are regular networks with connectivity 3. Discussion starts by defining several network properties, such as average route-length and link and node utilization, for the fault-free condition. Alterations of these properties are investigated when a network failure takes place. Using the results for fault-free and faulty situations, a comparison is made between the topologies. Topologies 1 and 2 are also compared with other standard topologies like full ring, square grid and star topologies. Another regular network topology called the star-ring topology is also introduced and investigated for the same properties. Enough insight is given to devise an optimal re-routing strategy when a network failure takes place. A new idea of static routing strategy called the Static Disjoint Routing Strategy is introduced. This disjoint routing strategy is proven to be close in performance to that of traditional Dynamic Shortest Routing with a considerable gain in ease of operation. The disjoint routing table is used to investigate whether any link or node becomes over utilized in faulty situations. On the whole both topologies were found to be highly survivable structures with reasonable cost.
Master of Science

APA, Harvard, Vancouver, ISO, and other styles

4

Dingel, Janis. "Communication theory applied to selected problems in computational genetics." kostenfrei, 2009. https://mediatum2.ub.tum.de/node?id=796739.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Murray, Don C. Pratt Christopher L. "Remote network administration of the SEANET communication node system /." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1998. http://handle.dtic.mil/100.2/ADA355948.

Full text

Abstract:

Thesis (M.S. in Information Technology Management) Naval Postgraduate School, September 1998.
"September 1998." Thesis advisor: Rex Buddenberg. Includes bibliographical references (p. 139-140). Also available online.

APA, Harvard, Vancouver, ISO, and other styles

6

Murray, Don C., and Christopher L. Pratt. "Remote network administration of the SEANET communication node system." Thesis, Monterey, California. Naval Postgraduate School, 1998. http://hdl.handle.net/10945/8912.

Full text

Abstract:

Approved for public release; distribution is unlimited
Maritime data communications are expensive and of limited capacity. Currently there is no established infrastructure to support Internet connectivity for sea-going vessels. The SeaNet program is investigating maritime networking solutions. One aspect of the SeaNet program is promoting remote network management. Remote network management will provide the maritime research community with a flexible and cost-effective tool for monitoring sea based assets. The objective of this thesis is to investigate remote network management over a satellite connection in support of the SeaNet programs goals. To research the potential for remote network management, the Naval Postgraduate School has developed its own SeaNet laboratory. This laboratory simulates both the shipboard and shore-based infrastructure of the SeaNet program and conducts remote network management on these components. This thesis discusses the SeaNet program, network management concepts, the NPS SeaNet laboratory, research findings and recommendations for fliture research. Remote Network Management of the SeaNet Control Node system is possible, however, continued research in this area is needed

APA, Harvard, Vancouver, ISO, and other styles

7

Rahmani, Mehrnoush. "A resource-efficient IP-based network architecture for in-vehicle communication." München Verl. Dr. Hut, 2009. http://mediatum2.ub.tum.de/node?id=683840.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Moshiri, Hesam. "Implementation of a Generic Gateway as a Multipurpose Communication Node." Thesis, Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-24840.

Full text

Abstract:

Steering and navigation systems play an essential role in governing today’s leisure boats. CPAC Systems AB, a subsidiary of Volvo AB, satisfies a large part of the global market needs for this kind of products. CPAC Systems, among others, manufactures a well-known “steer-by-wire” (SBW) control system, the “Electronic Vessel Control” (a.k.a. EVC). The need to connect the EVC to systems and devices designed by other companies resulted in the development of “gateway” devices, which have a primary role in preserving the integrity of the overall system architecture. Whenever the SBW communicates with external products, gateways are used as electric isolators and protocol translators, in order to protect the integrity of the SBW function. Today, a number of different gateway devices are required to match the different interfaces to which the CPAC’s EVC system has to be connected. This thesis aims to tackle the huge diversification of the requirements and evaluates the possibility of designing a “single” product that satisfies most of the requirements. In addition to that, the work aims to design a flexible device that could be easily updated to comply with the potential needs of the incoming applications. This isbeneficial in terms of both technology and cost-efficiency. Existing gateway products are designed to fulfill the assigned tasks or just to do a specific protocol conversion and apart from this significant difference with a generic gateway, they have some limitations concerning environmental conditions and prospective upgrades. Therefore designing, testing and implementation of one multifunctional gateway to be applicable as a multipurpose communication node to cover several functionalities, would be beneficial. Several challenges arose in designing the generic gateway device, such as: hardware design with a limited number of connection I/Os (solution is limited to 20 I/Os, whereas current gateway products require as many as 35 I/Os), robustness, final cost and power consumption. The contribution of the thesis was to analyse current gateway products, to design the hardware (Schematic and PCB), to implement the software, to debug the operation, to verify of the designed hardware to ensure the operation of each part. For gathering test results and investigation of communication or instruction signals, industrial equipment like digital oscilloscope and CAN analyser have been used to prove the operation of the device which are demonstrated in the “design tests” part. In addition, robustness of the gateway has been tested against several industrial test parameters, such as temperature variations, isolation, power supply robustness and typical power consumption. The results of these tests are iscussed in the “robustness tests” part. By fulfilling all of these steps and collaboration with the company team, satisfactory results have been achieved.

APA, Harvard, Vancouver, ISO, and other styles

9

Li, Houmin Thomas Gwynedd A. "Geotextile antenna design for mobile phone cooperative communication relay node." Auburn, Ala., 2008. http://hdl.handle.net/10415/1498.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Ragab, A. H. M. "A high capacity multiprocessor X.25 packet switching node." Thesis, University of Essex, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.355389.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Node to Node Communication"

1

Murray, Don C. Remote network administration of the SEANET communication node system. Monterey, Calif: Naval Postgraduate School, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Clements, David Mark. Node Cookbook. Birmingham: Packt Publishing, Limited, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Copyright Paperback Collection (Library of Congress), ed. Messiah node. New York, NY: A ROC Book, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Singh, Madhusudan. Node-to-Node Approaching in Wireless Mesh Connectivity. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-0674-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Louise, Huber, ed. Moon-node astrology. York Beach, Me: S. Weiser, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Hjalmarson, Å., and W. J. Remme, eds. Sinus node inhibitors. Heidelberg: Steinkopff, 1991. http://dx.doi.org/10.1007/978-3-642-72458-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Pambuccian, Stefan E., and Ricardo H. Bardales. Lymph Node Cytopathology. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-6964-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Gresh, Lois H. The termination node. New York: Del Rey, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Ioachim, Harry L. Lymph node pathology. 2nd ed. Philadelphia: J.B. Lipincott Co., 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Gasparini, Giampietro, ed. Prognostic variables in node-negative and node-positive breast cancer. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5195-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Node to Node Communication"

1

Weik, Martin H. "node." In Computer Science and Communications Dictionary, 1098. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_12331.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Ost, Alexander. "Application Examples: Node Analysis." In Performance of Communication Systems, 143–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-662-04421-6_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Weik, Martin H. "root node." In Computer Science and Communications Dictionary, 1501. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_16470.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Weik, Martin H. "adjacent node." In Computer Science and Communications Dictionary, 30. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_381.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Weik, Martin H. "endpoint node." In Computer Science and Communications Dictionary, 521. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_6226.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Weik, Martin H. "node identification." In Computer Science and Communications Dictionary, 1098. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_12332.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Weik, Martin H. "node identifier." In Computer Science and Communications Dictionary, 1098. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_12333.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Weik, Martin H. "node name." In Computer Science and Communications Dictionary, 1098. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_12335.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Weik, Martin H. "node operator." In Computer Science and Communications Dictionary, 1098. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_12336.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Weik, Martin H. "parent node." In Computer Science and Communications Dictionary, 1229. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_13633.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Node to Node Communication"

1

Quist-Aphetsi, Kester, Bismark Tei Asare, and Laurent Nana. "IoT Node-Node Secure Communication Using RIPEMD-128 and DES." In 2019 International Conference on Cyber Security and Internet of Things (ICSIoT). IEEE, 2019. http://dx.doi.org/10.1109/icsiot47925.2019.00018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Newcome, Laurence. "Airborne Communication Node Market Analysis." In 1st UAV Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2002. http://dx.doi.org/10.2514/6.2002-3507.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Vishwakarma, S. A., and K. S. Sudeep. "Node assignment problem." In 2013 International Conference on Information Communication and Embedded Systems (ICICES 2013). IEEE, 2013. http://dx.doi.org/10.1109/icices.2013.6508324.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Biswash, Sanjay Kumar. "Node-to-Node Communication and Mobility Management Scheme for 5G Fog Networks." In 2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS). IEEE, 2019. http://dx.doi.org/10.1109/ants47819.2019.9118111.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bachus, E. J., R. P. Braun, Ch Caspar, H. M. Foisel, K. Heimes, N. Keil, B. Strebel, J. Vathke, and M. Weickhmann. "COHERENT OPTICAL MULTICARRIER SWITCHING NODE." In Optical Fiber Communication Conference. Washington, D.C.: OSA, 1989. http://dx.doi.org/10.1364/ofc.1989.pd13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Sha, Zhenghui, and Jitesh H. Panchal. "Estimating the Node-Level Behaviors in Complex Networks From Structural Datasets." In ASME 2013 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/detc2013-12063.

Full text

Abstract:

There is an emerging class of networks that evolve endogenously based on the local characteristics and behaviors of nodes. Examples of such networks include social, economic, and peer-to-peer communication networks. The node-level behaviors determine the overall structure and performance of these networks. This is in contrast to exogenously designed networks whose structures are directly determined by network designers. To influence the performance of endogenous networks, it is crucial to understand a) what kinds of local behaviors result in the observed network structures and b) how these local behaviors influence the overall performance. The focus in this paper is on the first aspect, where information about the structure of networks is available at different points in time and the goal is to estimate the behavior of nodes that resulted in the observed structures. We use three different approaches to estimate the node-level behaviors. The first approach is based on the generalized preferential attachment model of network evolution. In the second approach, statistical regression-based models are used to estimate the node-level behaviors from consecutive snapshots of the network structure. In the third approach, the nodes are modeled as rational decision-making agents who make linking decisions based on the maximization of their payoffs. Within the decision-making framework, the multinomial logit choice model is adopted to estimate the preferences of decision-making nodes. The autonomous system (AS) level Internet is used as an illustrative example to illustrate and compare the three approaches.

APA, Harvard, Vancouver, ISO, and other styles

7

Brust, Matthias R., Steffen Rothkugel, and Adrian Andronache. "Node Stability in Dynamic Communication Networks." In First Asia International Conference on Modelling & Simulation (AMS'07). IEEE, 2007. http://dx.doi.org/10.1109/ams.2007.73.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Khojastepour, M. A., K. Sundaresan, M. Farajzadeh-Tehrani, and S. Rangarajan. "Degrees of freedom per communication node." In 2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt). IEEE, 2014. http://dx.doi.org/10.1109/wiopt.2014.6850368.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Ali, Omar, Mahmoud F. Ayoub, and Moustafa Youssef. "Practical provably secure multi-node communication." In 2014 International Conference on Computing, Networking and Communications (ICNC). IEEE, 2014. http://dx.doi.org/10.1109/iccnc.2014.6785372.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Verdoscia, L., and U. Scafuri. "CODACS project: level-node communication policies." In Proceedings Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing. IEEE, 2003. http://dx.doi.org/10.1109/empdp.2003.1183578.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Node to Node Communication"

1

Agarwal, Vivek, Joseph Richardson, and Yanliang Zhang. Wireless Sensor Node Power Profiling Based on IEEE 802.11 and IEEE 802.15.4 Communication Protocols. Modeling and Simulation. Office of Scientific and Technical Information (OSTI), October 2015. http://dx.doi.org/10.2172/1245527.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Patil, B., H. Tschofenig, and D. Kroeselberg. Mobile IPv6 Security Framework Using Transport Layer Security for Communication between the Mobile Node and Home Agent. Edited by J. Korhonen. RFC Editor, May 2012. http://dx.doi.org/10.17487/rfc6618.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Hurley, Michael, and Randolph Nichols. Ground Node. Fort Belvoir, VA: Defense Technical Information Center, September 2009. http://dx.doi.org/10.21236/ada531987.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Hurley, Michael, and Christopher Powell. Sea Node. Fort Belvoir, VA: Defense Technical Information Center, September 2009. http://dx.doi.org/10.21236/ada532127.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Jankiewicz, E., J. Loughney, and T. Narten. IPv6 Node Requirements. RFC Editor, December 2011. http://dx.doi.org/10.17487/rfc6434.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Loughney, J., ed. IPv6 Node Requirements. RFC Editor, April 2006. http://dx.doi.org/10.17487/rfc4294.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Chown, T., J. Loughney, and T. Winters. IPv6 Node Requirements. RFC Editor, January 2019. http://dx.doi.org/10.17487/rfc8504.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Crawford, M. IPv6 Node Information Queries. RFC Editor, August 2006. http://dx.doi.org/10.17487/rfc4620.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

McKenzie, W., and J. Cheng. SNA APPN Node MIB. RFC Editor, March 1994. http://dx.doi.org/10.17487/rfc1593.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Perme, David, and Matthew T. Eaton. Intelligent Mission Controller Node. Fort Belvoir, VA: Defense Technical Information Center, May 2002. http://dx.doi.org/10.21236/ada413588.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!